Gallai—Ramsey Number for the Union of Stars
نویسندگان
چکیده
Given a graph G and positive integer k, define the Gallai—Ramsey number to be minimum of vertices n such that any k-edge coloring Kn contains either rainbow (all different colored) triangle or monochromatic copy G. In this paper, we obtain exact values numbers for union two stars in many cases bounds other cases. This work represents first class disconnected graphs considered as desired subgraph.
منابع مشابه
study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
the use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولthe role of russia in transmission of energy from central asia and caucuses to european union
پس ازفروپاشی شوروی،رشد منابع نفت و گاز، آسیای میانه و قفقاز را در یک بازی ژئوپلتیکی انرژی قرار داده است. با در نظر گرفتن این منابع هیدروکربنی، این منطقه به یک میدانجنگ و رقابت تجاری برای بازی های ژئوپلتیکی قدرت های بزرگ جهانی تبدیل شده است. روسیه منطقه را به عنوان حیات خلوت خود تلقی نموده و علاقمند به حفظ حضورش می باشد تا همانند گذشته گاز طبیعی را به وسیله خط لوله مرکزی دریافت و به عنوان یک واس...
15 صفحه اولA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملAntimagic labeling of the union of stars
Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-one map f taking the vertices and edges onto 1, 2, . . . , p + q so that the edge-weights w(u, v) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic progression, starting from a and having common difference d. Moreover, such a labeling is called super (a, d)edge-antimagic total if f(V (G)) = {1, 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Sinica
سال: 2022
ISSN: ['1439-7617', '1439-8516']
DOI: https://doi.org/10.1007/s10114-022-0467-1